A Multilevel Energy-based Quantization Scheme

نویسندگان

  • Maria Emelianenko
  • Qiang Du
چکیده

A vector quantizer maps N -dimensional vectors in the domain Ω ⊂ R into a finite set of vectors {zi}i=1 . Each vector zi is called a code vector or a codeword, and the set of all the codewords is called a codebook. A special, yet popular, quantization scheme is given by the Voronoi tessellation associated with some codewords {zi} , also called generators. A Voronoi tessellation for the given generating points {zi}i=1 ⊂ Ω refers to the tessellation of a given domain Ω by the Voronoi regions {Vi}i=1 where, for each i , the Voronoi region Vi consists of all points in Ω that are closer to zi than to the other generating points. For a density function ρ defined on Ω , we define the centroids, or mass centers, of the regions {Vi}i=1 by zi = ( ∫

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Convergence of a Multilevel Energy-based Quantization Scheme

Quantization has diverse applications in many areas of science and engineering. In this paper, we present a new nonlinear multilevel algorithm that accelerates existing numerical approaches for finding optimal quantizers. Both theoretical framework for the convergence analysis and results of computational experiments are provided.

متن کامل

Uniform Convergence of a Nonlinear Energy-Based Multilevel Quantization Scheme

A popular vector quantization scheme can be constructed by the Centroidal Voronoi tessellations (CVTs) which also have many other applications in diverse areas of science and engineering. The development of efficient algorithms for their construction is a key to the successful applications of CVTs in practice. This paper studies the details of a new optimization based multilevel algorithm for t...

متن کامل

A Robust Digital Image Watermarking Scheme Based on DWT

In this paper a wavelet-based logo watermarking scheme is presented. The logo watermark is embedded into all sub-blocks of the LLn sub-band of the transformed host image, using quantization technique. Extracted logos from all sub-blocks are merged to make the extracted watermark from distorted watermarked image. Knowing the quantization step-size, dimensions of logo and the level of wavelet tra...

متن کامل

A Robust Digital Image Watermarking Scheme Based on DWT

In this paper a wavelet-based logo watermarking scheme is presented. The logo watermark is embedded into all sub-blocks of the LLn sub-band of the transformed host image, using quantization technique. Extracted logos from all sub-blocks are merged to make the extracted watermark from distorted watermarked image. Knowing the quantization step-size, dimensions of logo and the level of wavelet tra...

متن کامل

The Graduate School MULTILEVEL AND ADAPTIVE METHODS FOR SOME NONLINEAR OPTIMIZATION PROBLEMS

In this thesis, we propose new multilevel and adaptive methods for solving nonlinear non-convex optimization problems without relying on the linearization. We focus on two particular applications, that come from the fields of quantization and materials science. For the first problem, a multilevel quantization scheme is developed, that possesses a uniform convergence independent of the problem s...

متن کامل

Detection of perturbed quantization (PQ) steganography based on empirical matrix

Perturbed Quantization (PQ) steganography scheme is almost undetectable with the current steganalysis methods. We present a new steganalysis method for detection of this data hiding algorithm. We show that the PQ method distorts the dependencies of DCT coefficient values; especially changes much lower than significant bit planes. For steganalysis of PQ, we propose features extraction from the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005